Self-Stabilizing Hierarchical Clustering

نویسندگان

  • Alain BUI
  • Simon CLAVIÈRE
  • Ajoy K. DATTA
  • Lawrence L. LARMORE
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-Stabilizing Bounded Size Clustering Algorithm

Clustering means partitioning nodes into groups called clusters, providing the network with a hierarchical organization. Overall, clustering increases the scalability of network management. For instance, clustering-based routing reduces the amount of routing information propagated in the network; members of a cluster can share resources; and clustering can be used to reduce the amount of inform...

متن کامل

Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks

Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a xed infrastructure. Fast self-recon guration and power e ciency are very important property on any sensor network management. The clustering problem consists in partitioning network nodes into groups called clusters, thus giving at the network a hierarchical organization. Clus...

متن کامل

Self-Stabilizing Clustering Algorithm for Ad hoc Networks

Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such network cannot rely on centralized and organized connectivity. The clustering problem consists in partitioning network nodes into groups called clusters, thus giving at the network a hierarchical organization. Clustering is commonly used in order to limit the amount of routi...

متن کامل

Robust Self-stabilizing Clustering Algorithm

Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such network cannot rely on centralized and organized network management. The clustering problem consists in partitioning network nodes into groups called clusters, thus giving at the network a hierarchical organization. A self-stabilizing algorithm, regardless of the initial sys...

متن کامل

Robust self-stabilizing weight-based clustering algorithm

Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such networks cannot rely on centralized and organized network management. The clustering problem consists of partitioning network nodes into non-overlapping groups called clusters. Clusters give a hierarchical organization to the network that facilitates the network management a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011